Equivalence of permutation polytopes corresponding to strictly supermodular functions
نویسندگان
چکیده
منابع مشابه
Permutation polytopes corresponding to strongly supermodular functions
Throughout, let p be a positive integer and let be the set of permutations over {1; : : : ; p}. A real-valued function over subsets of {1; : : : ; p}, with (∅)=0, de7nes a mapping of into R where ∈ is mapped into the vector whose kth coordinate ( )k is the augmented -value obtained from adding k to the coordinates that precede it, according to the ranking induced by . The permutation polytope c...
متن کاملOn Permutation Polytopes - Notions of Equivalence
By assigning a permutation polytope to a group we produce new interesting polytopes. For the effective use of this construction method it is desirable to understand which groups are leading to affine equivalent polytopes. Therefore, the notion of effective equivalence has been introduced [BHNP09]. In this note we clarify the notion of effective equivalence and characterize geometrically the eff...
متن کاملThe number of classes of choice functions under permutation equivalence
A choice function f of an n-set X is a function whose domain is the power set P(X), and whose range is X, such that f(A) E A for each A ~ X. If k is a fixed positive integer, k :::; n, by a k-restricted choice function we mean the restriction of some choice function to the collection of k-subsets of X. The symmetric group Sx acts, by natural extension on the respective collections C(X) of choic...
متن کاملPermutation Polytopes of Cyclic Groups
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is...
متن کاملPermutation equivalence of cubic rotation symmetric Boolean functions
Rotation symmetric Boolean functions have been extensively studied for about 15 years because of their applications in cryptography and coding theory. Until recently little was known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.09.019